NP-completeness of Partial Chirotope Extendibility

نویسنده

  • Patrick Baier
چکیده

In the monograph “Axioms and Hulls” (1992) [2] Donald Knuth studies some axiomatizations of geometric situations. The structures described by one of the axiom systems are called CC-systems. Knuth proves that it is NP-complete to decide, whether a partially defined CC-system can be extended to a complete CC-system. The aim of this note is to show that Knuth’s proof of this result also implies that it is NP-complete to decide the extendability of partially defined chirotopes. Together with Stefan Felsner I’ve been interested in the question, whether partially given signotopes are extendable (cf. [1] for signotopes). Through a talk of Bernd Gärtner in Berlin we learned about a proof for the NPcompleteness of chirotope extendibility by Falk Tschirschnitz [3, 4]. Remarks of Ileana Streinu and Stefan Felsner brought my attention to an NPcompleteness proof of Knuth [2]. In fact, the work of Knuth implies that it is NP-complete to decide the extendability of partially defined chirotopes. The aim of this note is to make the connections clear. Knuth defines CC-systems as a boolean function of all ordered triples of a given finite groundset (whose elements are usually referred to as points) following five Axioms, where an expression of the form pqr means that the value associated with (p, q, r) is true (p. 3-4): Axiom 1: pqr =⇒ qrp (cyclic symmetry) Axiom 2: pqr =⇒ ¬ prq (antisymmetry) Axiom 3: pqr ∨ prq (nondegeneracy) Axiom 4: tqr ∧ ptr ∧ pqt =⇒ pqr (interiority) Axiom 5: tsp ∧ tsq ∧ tsr ∧ tpq ∧ tqr =⇒ tpr (transitivity) Axiom 5’: tps ∧ tqs ∧ trs ∧ tpq ∧ tqr =⇒ tpr (dual transitivity) (Each of these axioms is to be read with an implied quantification “for all Page numbers always refer to Knuth’s monograph [2].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling of Partial Digest Problem as a Network flows problem

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

متن کامل

The partial inverse minimum cut problem with L 1-norm is strongly NP-hard

The partial inverse minimum cut problem is to minimally modify the capacities of a digraph such that there exists a minimum cut with respect to the new capacities that contains all arcs of a prespecified set. Orlin showed that the problem is strongly NP-hard if the amount of modification is measured by the weighted L1-norm. We prove that the problem remains hard for the unweighted case and show...

متن کامل

Extending Partial Representations of Unit Circular-arc Graphs

The partial representation extension problem, introduced by Klav́ık et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs.

متن کامل

Convexity in Partial Cubes: The Hull Number

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves earlier results in the literature. On the other hand we provide a polynomial-time algorithm to determine the hull number of planar partial cube quadrangulations. Inst...

متن کامل

Completeness and Compactness of Quantitative Domains

In this paper we study the interplay between metric and order completeness of semantic domains equipped with generalised distances. We prove that for bounded complete posets directed-completeness and partial metric completeness are interdefinable. Moreover, we demonstrate that Lawson-compact, countably based domains are precisely the compact pmetric spaces that are continuously ordered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008